منابع مشابه
Regular Factorizations of Contractions
Equivalent conditions are given for the regularity of a factorization of a contraction, two of which exhibit immediately the duality property of this notion. The concept of regular factorization of contractions of Hubert spaces1 was introduced in [1] by the authors in connection with their investigations on the invariant subspace problem; cf. [2, §VIL3]. Let A0 be a contraction of a Hubert spac...
متن کامل1-Factorizations of random regular graphs
It is shown that for each r 3, a random r-regular graph on 2n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2n vertices, as n ! 1. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almost sure in one sequence of spaces are almost sure in the other, and vice versa. The corresponding sta...
متن کاملOne-Factorizations of Regular Graphs of Order 12
Algorithms for classifying one-factorizations of regular graphs are studied. The smallest open case is currently graphs of order 12; one-factorizations of r-regular graphs of order 12 are here classified for r ≤ 6 and r = 10, 11. Two different approaches are used for regular graphs of small degree; these proceed one-factor by one-factor and vertex by vertex, respectively. For degree r = 11, we ...
متن کاملTriangulated Categories of Matrix Factorizations for Regular Systems of Weights with Ε = − 1
Abstract. We construct a full strongly exceptional collection in the triangulated category of graded matrix factorizations of a polynomial associated to a non-degenerate regular system of weights whose smallest exponents are equal to −1. In the associated Grothendieck group, the strongly exceptional collection defines a root basis of a generalized root system of sign (l, 0, 2) and a Coxeter ele...
متن کاملNew Fft/ifft Factorizations with Regular Interconnection Pattern Stage-to-stage Subblocks
FFT (Fast Fourier Transform) factorizations presenting a regular interconnection pattern between factors or stages are known as parallel algorithms, or Pease algorithms since were first proposed by Pease. In this paper, new FFT/IFFT (Inverse FFT) factorizations with blocks that exhibit regular Pease interconnection pattern are derived. It is shown these blocks can be obtained at a previously se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1974
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1974-0336411-7